Incremental Deployment of Network Monitors Based on Group Betweenness Centrality

نویسندگان

  • Shlomi Dolev
  • Yuval Elovici
  • Rami Puzis
  • Polina Zilberman
چکیده

Shlomi Dolev, Yuval Elovici, Rami Puzis, Polina Zilberman Abstract In many applications we are required to increase the deployment of a distributed monitoring system on an evolving network. In this paper we present a new method for finding candidate locations for additional deployment in the network. This method is based on the Group Betweenness Centrality (GBC) measure that is used to estimate the influence of a group of nodes over the information flow in the network. The new method assists in finding the location of k additional monitors in the evolving network, such that the portion of additional traffic covered is at least ( ) e 1 1− of the optimal.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Rationality and Optimality of Transportation Networks Defense — a Network Centrality Approach

Transportation infrastructures have recently gained increasing attention in the context of homeland security. Being both a main target for attacks as well as a method for carrying out such attacks, much effort is being allocated these days towards increasing our understanding regarding transportation networks [14]. Specifically, measuring and predicting human mobility patterns along the links o...

متن کامل

Finding the most prominent group in complex networks

In many applications we are required to locate the most prominent group of vertices in a complex network. Group Betweenness Centrality can be used to evaluate the prominence of a group of vertices. Evaluating the Betweenness of every possible group in order to find the most prominent is not computationally feasible for large networks. In this paper we present two algorithms for finding the most...

متن کامل

Further Results on Betweenness Centrality of Graphs

Betweenness centrality is a distance-based invariant of graphs. In this paper, we use lexicographic product to compute betweenness centrality of some important classes of graphs. Finally, we pose some open problems related to this topic.

متن کامل

Augmented Betweenness Centrality for Environmentally Aware Traffic Monitoring in Transportation Networks

Network planning and traffic flow optimization requires the acquirement and analysis of large quantities of data such as the network topology, its traffic flow data, vehicle fleet composition, emission measurements etc. Data acquirement is an expensive process that involves household surveys and automatic as well as semi-automatic measurements performed all over the network. For example, in ord...

متن کامل

A GPU-Based Solution to Fast Calculation of Betweenness Centrality on Large Weighted Networks

Recent decades have witnessed the tremendous development of network science, which indeed brings a new and insightful language to model real systems of different domains. Betweenness, a widely employed centrality in network science, is a decent proxy in investigating network loads and rankings. However, the extremely high computational cost greatly prevents its applying on large networks. Thoug...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Inf. Process. Lett.

دوره 109  شماره 

صفحات  -

تاریخ انتشار 2009